Characterizing Storage Workloads with Counter Stacks

نویسندگان

  • Jake Wires
  • Stephen Ingram
  • Zachary Drudi
  • Nicholas J. A. Harvey
  • Andrew Warfield
چکیده

Existing techniques for identifying working set sizes based on miss ratio curves (MRCs) have large memory overheads which make them impractical for storage workloads. We present a novel data structure, the counter stack, which can produce approximate MRCs while using sublinear space. We show how counter stacks can be checkpointed to produce workload representations that are many orders of magnitude smaller than full traces, and we describe techniques for estimating MRCs of arbitrary workload combinations over arbitrary windows in time. Finally, we show how online analysis using counter stacks can provide valuable insight into live workloads.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Performance Variation in Modern Storage Stacks

Ensuring stable performance for storage stacks is important, especially with the growth in popularity of hosted services where customers expect QoS guarantees. The same requirement arises from benchmarking settings as well. One would expect that repeated, carefully controlled experiments might yield nearly identical performance results—but we found otherwise. We therefore undertook a study to c...

متن کامل

Chronicle: Capture and Analysis of NFS Workloads at Line Rate

Insights from workloads have been instrumental in hardware and software design, problem diagnosis, and performance optimization. The recent emergence of software-defined data centers and application-centric computing has further increased the interest in studying workloads. Despite the ever-increasing interest, the lack of general frameworks for trace capture and workload analysis at line rate ...

متن کامل

Real-Counter Automata and Their Decision Problems

We introduce real-counter automata, which are two-way finite automata augmented with counters that take real values. In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers. We study the membership and emptiness problems for one-way/twoway real-counter au...

متن کامل

Real-Counter Automata and Verification

We introduce real-counter automata, which are two-way finite automata augmented with counters that take real values. In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers. We study the membership and emptiness problems for one-way/twoway real-counter au...

متن کامل

On the Intersection of Stacks and Queues

What do a pushdown stack and a queue have in common? What is their intersection? Is it a counter? If we add a retrieval restriction, what is the intersection of a one-reversal pushdown and a queue, or, by symmetry, of a one-reset tape and a pushdown, or both, a one-reversal pushdown and a one-reset queue? Is it a one-reversal counter? These and similar claims are conjectured by Autebert et al. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014